Location:
Search - heap insert
Search list
Description: 大约有10种排序方法，如堆排序、快速排序、归并排序、插入排序、外壳排序、选择排序、早泡排序、线性排序、地址选择排序和基排序。我自己提出了一种简化的快速排序。-about 10 species of sequencing methods, such as heap sort, quick sort, merge, in order to insert sequencing, shell sort, select, in order of ranking as foam, linear ordering, sequencing and address choice-based ranking. I propose a simplified Quick Sort.
Platform: |
Size: 4738 |
Author: 宁华锋 |
Hits:
Description: 本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.
Platform: |
Size: 78562 |
Author: 吴晓辉 |
Hits:
Description: 很好的一个DD。。 能够进行快速排序...利用C语言实现，8种排序算法！ 例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-good a DD. . To conduct rapid sequencing ... use C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Platform: |
Size: 5107 |
Author: 333 |
Hits:
Description: java 排序，冒泡排序，快速排序，选择排序，插入排序，堆排序，归并排序等等！-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!
Platform: |
Size: 6766 |
Author: 丁如敏 |
Hits:
Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较：
必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序；
选做：折半插入、二路归并、基数排序等等；
2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s)
其中：
a) XXXXSort为排序函数名，具体如下：
起泡排序BubbleSort
直接插入排序InsertSort
简单选择排序SelectSort
快速排序QuickSort
希尔排序ShellSort
堆排序HeapSort
折半插入BInsertSort
二路归并Merge2Sort
基数排序RadixSort
b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行；
c) c用于返回关键字比较次数；
d) s用于返回移动次数；
3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。
-a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char ** list, int len, int n, int * c, int * s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha
Platform: |
Size: 10289 |
Author: 战天 |
Hits:
Description: 提高输入容错。判断输入的对错。 时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法； 排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序；sinsert：插入排序；quicks:快速排序；select:选择排序法；-increase input fault tolerance. Imported wrong judgment. The time, a search function for the linear search is enhanced as follows : f_search : Fernandez search method; BTREE : binary tree search method; L_search : linear search method; R_search : recursive binary search method; Zcsear : hash collision search method; " Files : interpolation search Enhancement Act; Sorting is bubbling, as it is now : heaps : tired heap sort; binary : Binary Tree sorting; xieer : Xie ears scheduling; sinsert : Insert scheduling; quicks : rapid sequencing; select : Select Sort;
Platform: |
Size: 4796 |
Author: 王军 |
Hits:
Description: 利用C语言实现，8种排序算法！ 例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Platform: |
Size: 3090 |
Author: 叶兆源 |
Hits:
Description: 本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.
Platform: |
Size: 77824 |
Author: 吴晓辉 |
Hits:
Description: 選擇排序法的概念簡單，每次從未排序部份選一最小值，插入已排序部份的後端，其時間主要花費於在整個未排序部份尋找最小值，如果能讓搜尋最小值的方式加快，選擇排序法的速率也就可以加快，Heap排序法讓搜尋的路徑由樹根至最後一個樹葉，而不是整個未排序部份，因而稱之為改良的選擇排序法。-Select sort method simple in concept, each part of the election has never been one to sort the minimum, insert has some sort of back-end, spent their time mainly in the unsorted part of the whole search for the minimum, if allowed to search for the minimum value of ways to speed up, select the sort method can also speed up the rate, Heap sort method so that the search path from the root to the last one leaves, not the whole part of unsorted and thus referred to as the choice of ordering method improved.
Platform: |
Size: 4096 |
Author: 王凌云 |
Hits:
Description: 关于快速，堆，插入，冒泡排序之间的比较，对于刚开始学的有很大的帮助-On the rapid, heap, insert, Bubble Sort of comparisons between the beginning of school for the great help
Platform: |
Size: 2048 |
Author: Venus |
Hits:
Description: 這是一個用C語言所寫的minHeap程式
具有create,findmin,deletemin,Insert這些函式-It is written in a language with a C program with minHeap create, findmin, deletemin, Insert these functions
Platform: |
Size: 1024 |
Author: 林文華 |
Hits:
Description: 堆的基本操作，插入删除，把数组变为小根堆，并检查是否为小根堆，用小根堆排序的方法按降序对大小为n的数组进行排序。-The basic operation of the heap, insert delete the array into a heap of small roots, and check the heap for small roots, roots with a small heap sort in descending order by means of an array of size n sort.
Platform: |
Size: 1024 |
Author: 依枫 |
Hits:
Description: 输入序列能调整为最小堆，能模拟调整过程，能够插入和删除-Input sequence can be adjusted to minimum heap, can simulate the process of adjustment that can insert and delete
Platform: |
Size: 145408 |
Author: emily |
Hits:
Description: heap data structure implemented. insert delete operations implemented in java
Platform: |
Size: 1024 |
Author: wrathod |
Hits:
Description: 堆的插入、删除、查找、建立等操作，简单能用就行了-Heap insert, delete, find, build, etc, can be used simply on the line ......
Platform: |
Size: 366592 |
Author: zhaoxuefeng |
Hits:
Description: 优先级队列的相关操作,包括返回最大堆,插入数据,消除数据后重新建立堆等-Priority queue operations, including the return to the maximum heap, insert data, eliminating data re-establish the heap
Platform: |
Size: 1024 |
Author: m4king |
Hits:
Description: 大顶堆及优先队列的完整实现，包括插入、改变、抽出元素的实现以及实现堆排序。-The big top of the heap and priority queue complete implementation, including insert, change, taking the elements of the implementation and realization of the heap sort.
Platform: |
Size: 1024 |
Author: 李天喜 |
Hits:
Description: 最小堆的实现
最小堆的创建、调整、插入和删除算法，运用C++类实现最小堆的类定义及基本操作算法
-Minimum heap to achieve the minimum heap to create, adjust, insert and delete algorithms use C++ class to class definition and the basic operation algorithms to achieve the minimum heap
Platform: |
Size: 2048 |
Author: 林文众 |
Hits:
Description: 构造霍夫曼树 //////////////////////
//根据权重生成霍夫曼树
//weight 权重数组
//n 权重数组长度
//NewTree 新生成的霍夫曼树
void createHFMTree(int* weights,int n,BinaryTree<int>& NewTree)
{
//初始化堆
MinHeap<BinaryTree<int> > heap(n)
int i=0
for( i<n i++){
heap.Insert(BinaryTree<int>(weights[i]))
}
//选择堆中根数值较小的两棵树，组成一棵新树然后插入堆里，并把原来的两棵树从堆里删除-Construct the Huffman tree//////////////////////// to generate Huffman tree// weight weights array// n weights array length// NewTree weight new Huffman tree generated void createHFMTree (int* weights, int n, BinaryTree <int> & NewTree) {//initialize heap MinHeap <BinaryTree<int> > Heap (n) int i = 0 for ( i <n i++){
heap.Insert(BinaryTree<int> (Weights [i])) }// Select heap root smaller value of the two trees, and then inserted into the pile to form a new tree and two trees removed from the pile
Platform: |
Size: 3072 |
Author: kimikami |
Hits:
Description: 树堆，实现树堆的插入删除查找最大最小前驱后继和遍历功能-Tree heap, heap insert delete search tree to achieve the maximum and minimum precursor of subsequent and traversal functions
Platform: |
Size: 1756160 |
Author: kwind |
Hits: